A Quantum Algorithm for finding Minimal Exclusive-Or Expressions for incompletely specified Boolean Functions

نویسندگان

  • M. Sampson
  • D. Voudouris
  • M. Kalathas
  • G. Papakonstantinou
چکیده

This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed xor expressions such as ESCT can be used to implement an arbitrary Boolean function into a reversible or even a quantum circuit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions using Variable Reordering

This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary incompletely specified switching function taking into account the variable ordering. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the ...

متن کامل

A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions

This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed Exclusive-O...

متن کامل

A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Incompletely Specified Boolean Functions. PRELIMINARY VERSION

This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incompletely specified switching function. The proposed algorithm takes advantage of the inherent massive parallelism of quantum circuits in order to achieve better complexity than the conventional ones. The proposed Exclusive-O...

متن کامل

Fixed Polarity Reed-muller Minimization of Incompletely Specified Boolean Functions Based on Information Estimations on Decision Trees

This paper presents algorithm to find minimal Fixed Polarity Reed-Muller expressions, twolevel fixed polarity AND-EXOR canonical representations, for incompletely specified Boolean functions that based on information measures on decision trees. We study the Free Reed-Muller Tree as acceptable representation and manipulation structure to find minimal Fixed Polarity Reed-Muller expressions. In co...

متن کامل

Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7

In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven complex terms, regardless of the number of input variables. This kind of logical expressions can be mapped to a special cellular architecture, called Reversible Wave Cascade Architecture. This topology is proved to be very u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007